The existing social network privacy protection method mostly aims at the individuals of the social network, which cannot protect effectively the sensitive relations in the social network. Therefore, this paper proposes a new personalized K_L model. This model requires each sensitive relation with the sensitive relational point have l at least, and also the point with the same requirement has k ...

We show that if $\Omega$ is a vanishing chord-arc domain and $L$ divergence-form elliptic operator with H\"older-continuous coefficient matrix, then $\log k_L \in VMO$, where $k_L$ the kernel for in $\Omega$. This extends previous work of Kenig Toro case Laplacian.

An $r$-uniform hypergraph is linear if every two edges intersect in at most one vertex. Given a family of hypergraphs $\mathcal{F}$, the Turán number ex$_r^{lin}(n,\mathcal{F})$ maximum on $n$ vertices that does not contain any member $\mathcal{F}$ as subgraph.
 Let $K_l$ be complete graph with $l$ and $r\geq 2$. The $r$-expansion $r$-graph $K_l^+$ obtained from by enlarging each edge $r-2...

The rare decay $K_L \!\to\! \pi^0 \nu \overline{\nu}$ was studied with the dataset taken at J-PARC KOTO experiment in 2016, 2017, and 2018. With a single event sensitivity of $( 7.20 \pm 0.05_{\rm stat} 0.66_{\rm syst} ) \times 10^{-10}$, three candidate events were observed signal region. After unveiling them, contaminations from $K^{\pm}$ scattered $K_L$ decays studied, total number backgroun...

N lim 1( 1: f(nkx)) = 0, N-N k_l or roughly speaking the strong law of large numbers holds for f(nkx) (in fact the authors prove that Ef(nkx)/k converges almost everywhere) . The question was raised whether (2) holds for any f(x) . This was known for the case nk=2k( 2) . In the present paper it is shown that this is not the case . In fact we prove the following theorem . THEOREM 1 . There exist...